16,940 research outputs found
An Automata Based Text Analysis System
This report describes and implements an automata based text analysis system. We have collected some of the writing samples. Each sample establishes a tree, and uses the ALERGIA algorithm to merge all compatible nodes in order to get a merged stochastic finite automaton. We store these automatons which demonstrate writing style of the sample texts in the hard drive. For a new testing piece, we can test if it has similar writing style compared to those sample texts
Sampling Sparse Signals on the Sphere: Algorithms and Applications
We propose a sampling scheme that can perfectly reconstruct a collection of
spikes on the sphere from samples of their lowpass-filtered observations.
Central to our algorithm is a generalization of the annihilating filter method,
a tool widely used in array signal processing and finite-rate-of-innovation
(FRI) sampling. The proposed algorithm can reconstruct spikes from
spatial samples. This sampling requirement improves over
previously known FRI sampling schemes on the sphere by a factor of four for
large . We showcase the versatility of the proposed algorithm by applying it
to three different problems: 1) sampling diffusion processes induced by
localized sources on the sphere, 2) shot noise removal, and 3) sound source
localization (SSL) by a spherical microphone array. In particular, we show how
SSL can be reformulated as a spherical sparse sampling problem.Comment: 14 pages, 8 figures, submitted to IEEE Transactions on Signal
Processin
On Sparse Representation in Fourier and Local Bases
We consider the classical problem of finding the sparse representation of a
signal in a pair of bases. When both bases are orthogonal, it is known that the
sparse representation is unique when the sparsity of the signal satisfies
, where is the mutual coherence of the dictionary.
Furthermore, the sparse representation can be obtained in polynomial time by
Basis Pursuit (BP), when . Therefore, there is a gap between the
unicity condition and the one required to use the polynomial-complexity BP
formulation. For the case of general dictionaries, it is also well known that
finding the sparse representation under the only constraint of unicity is
NP-hard.
In this paper, we introduce, for the case of Fourier and canonical bases, a
polynomial complexity algorithm that finds all the possible -sparse
representations of a signal under the weaker condition that . Consequently, when , the proposed algorithm solves the
unique sparse representation problem for this structured dictionary in
polynomial time. We further show that the same method can be extended to many
other pairs of bases, one of which must have local atoms. Examples include the
union of Fourier and local Fourier bases, the union of discrete cosine
transform and canonical bases, and the union of random Gaussian and canonical
bases
- …